Multilevel refinable triangular PSP-splines (Tri-PSPS)

A multi-level spline technique known as partial shape preserving splines (PSPS) (Li and Tian, 2011) has recently been developed for the design of piecewise polynomial freeform geometric surfaces, where the basis functions of the PSPS can be directly built from an arbitrary set of polygons that partitions a giving parametric domain. This paper addresses a special type of PSPS, the triangular PSPS (Tri-PSPS), where all spline basis functions are constructed from a set of triangles. Compared with other triangular spline techniques, Tri-PSPS have several distinctive features. Firstly, for each given triangle, the corresponding spline basis function for any required degree of smoothness can be expressed in closed-form and directly written out in full explicitly as piecewise bivariate polynomials. Secondly, Tri-PSPS are an additive triangular spline technique, where the spline function built from a given triangle can be replaced with a set of refined spline functions built on a set of smaller triangles that partition the initial given triangle. In addition, Tri-PSPS are a multilevel spline technique, Tri-PSPS surfaces can be designed to have a continuously varying levels of detail, achieved simply by specifying a proper value for the smoothing parameter introduced in the spline functions. In terms of practical implementation, Tri-PSPS are a parallel computing friendly spline scheme, which can be easily implemented on modern programmable GPUs or on high performance computer clusters, since each of the basis functions of Tri-PSPS can be directly computed independent of each other in parallel

Registration techniques for computer assisted orthopaedic surgery

The registration of 3D preoperative medical data to patients is a key task in developing computer assisted surgery systems. In computer assisted surgery, the patient in the operation theatre must be aligned with the coordinate system in which the preoperative data has been acquired, so that the planned surgery based on the preoperative data can be carried out under the guidance of the computer assisted surgery system.The aim of this research is to investigate registration algorithms for developing computer assisted bone surgery systems. We start with reference mark registration. New interpretations are given to the development of well knowm algorithms based on singular value decomposition, polar decomposition techniques and the unit quaternion representation of the rotation matrix. In addition, a new algorithm is developed based on the estimate of the rotation axis. For non-land mark registration, we first develop iterative closest line segment and iterative closest triangle patch registrations, similar to the well known iterative closest point registration, when the preoperative data are dense enough. We then move to the situation where the preoperative data are not dense enough. Implicit fitting is considered to interpolate the gaps between the data . A new ellipsoid fitting algorithm and a new constructive implicit fitting strategy are developed. Finally, a region to region matching procedure is proposed based on our novel constructive implicit fitting technique. Experiments demonstrate that the new algorithm is very stable and very efficient

A subdivision-based implementation of non-uniform local refinement with THB-splines

Paper accepted for 15th IMA International Conference on Mathematics on Surfaces, 2017. Abstract: Local refinement of spline basis functions is an important process for spline approximation and local feature modelling in computer aided design (CAD). This paper develops an efficient local refinement method for non-uniform and general degree THB-splines(Truncated hierarchical B-splines). A non-uniform subdivision algorithm is improved to efficiently subdivide a single non-uniform B-spline basis function. The subdivision scheme is then applied to locally hierarchically refine non-uniform B-spline basis functions. The refined basis functions are non-uniform and satisfy the properties of linear independence, partition of unity and are locally supported. The refined basis functions are suitable for spline approximation and numerical analysis. The implementation makes it possible for hierarchical approximation to use the same non-uniform B-spline basis functions as existing modelling tools have used. The improved subdivision algorithm is faster than classic knot insertion. The non-uniform THB-spline approximation is shown to be more accurate than uniform low degree hierarchical local refinement when applied to two classical approximation problems

Bio-AKA: An efficient fingerprint based two factor user authentication and key agreement scheme

The fingerprint has long been used as one of the most important biological features in the field of biometrics. It is person-specific and remain identical though out one’s lifetime. Physically uncloneable functions (PUFs) have been used in authentication protocols due to the unique physical feature of it. In this paper, we take full advantage of the inherent security features of user’s fingerprint biometrics and PUFs to design a new user authentication and key agreement scheme, namely Bio-AKA, which meets the desired security characteristics. To protect the privacy and strengthen the security of biometric data and to improve the robustness of the proposed scheme, the fuzzy extractor is employed. The scheme proposed in the paper can protect user’s anonymity without the use of password and allow mutual authentication with key agreement. The experimental results show superior robustness and the simplicity of our proposed scheme has been validated via our performance and security analysis. The scheme can be an ideal candidate for real life applications that requires remote user authentication

Consensus Adversarial Defense Method Based on Augmented Examples

Deep learning has been used in many computer-vision-based industrial Internet of Things applications. However, deep neural networks are vulnerable to adversarial examples that have been crafted specifically to fool a system while being imperceptible to humans. In this study, we propose a consensus defense (Cons-Def) method to defend against adversarial attacks. Cons-Def implements classification and detection based on the consensus of the classifications of the augmented examples, which are generated based on an individually implemented intensity exchange on the red, green, and blue components of the input image. We train a convolutional neural network using augmented examples together with their original examples. For the test image to be assigned to a specific class, the class occurrence of the classifications on its augmented images should be the maximum and reach a defined threshold. Otherwise, it is detected as an adversarial example. The comparison experiments are implemented on MNIST, CIFAR-10, and ImageNet. The average defense success rate (DSR) against white-box attacks on the test sets of the three datasets is 80.3%. The average DSR against black-box attacks on CIFAR-10 is 91.4%. The average classification accuracies of Cons-Def on benign examples of the three datasets are 98.0%, 78.3%, and 66.1%. The experimental results show that Cons-Def shows a high classification performance on benign examples and is robust against white-box and black-box adversarial attacks

Developing a Semantic-Driven Hybrid Segmentation Method for Point Clouds of 3D Shapes

With the rapid development of point cloud processing technologies and the availability of a wide range of 3D capturing devices, a geometric object from the real world can be directly represented digitally as a dense and fine point cloud. Decomposing a 3D shape represented in point cloud into meaningful parts has very important practical implications in the fields of computer graphics, virtual reality and mixed reality. In this paper, a semantic-driven automated hybrid segmentation method is proposed for 3D point cloud shapes. Our method consists of three stages: semantic clustering, variational merging, and region remerging. In the first stage, a new feature of point cloud, called Local Concave-Convex Histogram, is introduced to first extract saddle regions complying with the semantic boundary feature. All other types of regions are then aggregated according to this extracted feature. This stage often leads to multiple over-segmentation convex regions, which are then remerged by a variational method established based on the narrow-band theory. Finally, in order to recombine the regions with the approximate shapes, order relation is introduced to improve the weighting forms in calculating the conventional Shape Diameter Function. We have conducted extensive experiments with the Princeton Dataset. The results show that the proposed algorithm outperforms the state-of-the-art algorithms in this area. We have also applied the proposed algorithm to process the point cloud data acquired directly from the real 3D objects. It achieves excellent results too. These results demonstrate that the method proposed in this paper is effective and universal

Local keypoint-based Faster R-CNN

Region-based Convolutional Neural Network (R-CNN) detectors have achieved state-of-the-art results on various challenging benchmarks. Although R-CNN has achieved high detection performance, the research of local information in producing candidates is insufficient. In this paper, we design a Keypoint-based Faster R-CNN (K-Faster) method for object detection. K-Faster incorporates local keypoints in Faster R-CNN to improve the detection performance. In detail, a sparse descriptor, which first detects the points of interest in a given image and then samples a local patch and describes its invariant features, is first employed to produce keypoints. All 2-combinations of the produced keypoints are second selected to generate keypoint anchors, which are helpful for object detection. The heterogeneously distributed anchors are then encoded in feature maps based on their areas and center coordinates. Finally, the keypoint anchors are coupled with the anchors produced by Faster R-CNN, and the coupled anchors are used for Region Proposal Network (RPN) training. Comparison experiments are implemented on PASCAL VOC 07/12 and MS COCO. The experimental results show that our K-Faster approach not only increases the mean Average Precision (mAP) performance but also improves the positioning precision of the detected boxes

A Survey of the methods on fingerprint orientation field estimation

Fingerprint orientation field (FOF) estimation plays a key role in enhancing the performance of the automated fingerprint identification system (AFIS): Accurate estimation of FOF can evidently improve the performance of AFIS. However, despite the enormous attention on the FOF estimation research in the past decades, the accurate estimation of FOFs, especially for poor-quality fingerprints, still remains a challenging task. In this paper, we devote to review and categorization of the large number of FOF estimation methods proposed in the specialized literature, with particular attention to the most recent work in this area. Broadly speaking, the existing FOF estimation methods can be grouped into three categories: gradient-based methods, mathematical models-based methods, and learning-based methods. Identifying and explaining the advantages and limitations of these FOF estimation methods is of fundamental importance for fingerprint identification, because only a full understanding of the nature of these methods can shed light on the most essential issues for FOF estimation. In this paper, we make a comprehensive discussion and analysis of these methods concerning their advantages and limitations. We have also conducted experiments using publically available competition dataset to effectively compare the performance of the most relevant algorithms and methods

3D vasculature segmentation using localized hybrid level-set method

Background: Intensity inhomogeneity occurs in many medical images, especially in vessel images. Overcoming the difficulty due to image inhomogeneity is crucial for the segmentation of vessel image. Methods: This paper proposes a localized hybrid level-set method for the segmentation of 3D vessel image. The proposed method integrates both local region information and boundary information for vessel segmentation, which is essential for the accurate extraction of tiny vessel structures. The local intensity information is firstly embedded into a region-based contour model, and then incorporated into the level-set formulation of the geodesic active contour model. Compared with the preset global threshold based method, the use of automatically calculated local thresholds enables the extraction of the local image information, which is essential for the segmentation of vessel images. Results: Experiments carried out on the segmentation of 3D vessel images demonstrate the strengths of using locally specified dynamic thresholds in our level-set method. Furthermore, both qualitative comparison and quantitative validations have been performed to evaluate the effectiveness of our proposed model. Conclusions: Experimental results and validations demonstrate that our proposed model can achieve more promising segmentation results than the original hybrid method does